منابع مشابه
On Packing T-Cuts
A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.
متن کاملOn shortest T-joins and packing T-cuts
Let G be an undirected connected graph. For each u E V(G), the node set of G, and each Fc E(G), the edge set of G, we define dF(u) to be the number of edges in F incident with u. If T& V(G), then we call a set Fs E(G) a T-join if T= {UE V(G)(d,( ) o is odd}. Throughout this paper we shall always assume ( T ( to be even. We denote the minimum cardinality of a T-join in G by z,(G). For UG V(G) we...
متن کاملCounting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time
We give an O(nd + n log n) algorithm computing the number of minimum (s, t)-cuts in weighted planar graphs, where n is the number of vertices and d is the length of the shortest s-t path in the corresponding unweighted graph. Previously, Ball and Provan gave a polynomial-time algorithm for unweighted planar graphs with both s and t lying on the outer face. Our results hold for all locations of ...
متن کاملMinimum Cuts
1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.
متن کاملT-lymphocyteCell InjectionCancer Immunotherapy: an Optimal Control Approach
We consider amathematical model in the form of a system of ordinary differential equations (ODE) foroptimally administrating cancer treatments. The ODE systemdynamics characterized by locating equilibrium points and stability propertiesare determined by linearization and usingappropriate Lyapunovfunctions. By applying optimal control theory, we seek to minimize the cost function associated with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00397-7